Monotonic Abstraction-Refinement for CTL
نویسندگان
چکیده
The goal of this work is to improve the efficiency and effectiveness of the abstraction-refinement framework for CTL over the 3-valued semantics. We start by proposing a symbolic (BDD-based) approach for this framework. Next, we generalize the definition of abstract models in order to provide a monotonic abstraction-refinement framework. To do so, we introduce the notion of hyper-ion-refinement framework. To do so, we introduce the notion of hypertransitions. For a given set of abstract states, this results in a more precise abstract model in which more CTL formulae can be proved or disproved. We suggest an automatic construction of an initial abstract model and its successive refined models. We complete the framework by adjusting the BDD-based approach to the new monotonic framework. Thus, we obtain a monotonic, symbolic framework that is suitable for both verification and falsification of full CTL.
منابع مشابه
Non-monotonic Refinement of Control Abstraction for Concurrent Programs
ion for Concurrent Programs Ashutosh Gupta, Corneliu Popeea, and Andrey Rybalchenko Technische Universität München Abstract. Verification based on abstraction refinement is a successful technique for checking program properties. Conventional abstraction refinement schemes increase precision of the abstraction monotonically, and therefore cannot recover from overly precise refinement decisions. ...
متن کاملConstrained Monotonic Abstraction: A CEGAR for Parameterized Verification
In this paper, we develop a counterexample-guided abstraction refinement (CEGAR) framework for monotonic abstraction, an approach that is particularly useful in automatic verification of safety properties for parameterized systems. The main drawback of verification using monotonic abstraction is that it sometimes generates spurious counterexamples. Our CEGAR algorithm automatically extracts fro...
متن کاملModel Checking with Formula-Dependent Abstract Models
Abstract. We present a model checking algorithm for CTL (and full CTL) which uses an iterative abstraction refinement strategy. In each iteration we call a standard model checker for the abstract models i. If i does not satisfy Φ we refine the abstract model i yielding another abstract model i 1 and (re-)call the model checker to i 1. Otherwise the formula holds for the original system . Our al...
متن کاملHeuristics for Selecting Predicates for Partial Predicate Abstraction
In this paper we consider the problem of configuring partial predicate abstraction that combines two techniques that have been effective in analyzing infinite-state systems: predicate abstraction and fixpoint approximations. A fundamental problem in partial predicate abstraction is deciding the variables to be abstracted and the predicates to be used. In this paper, we consider systems modeled ...
متن کامل